On Vertex Covering Transversal Domination Number of Regular Graphs
نویسندگان
چکیده
منابع مشابه
On the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملOn the Independent Domination Number of Random Regular Graphs
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either in v ∈ D or there exists a vertex u ∈ D that is adjacent to v. We are interested in finding dominating sets of small cardinality. A dominating set I of a graph G is said to be independent if no two vertices of I are connected by an edge of G. The size of a smallest independent dominating set of a g...
متن کاملIndependent transversal domination in graphs
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γ...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2016
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2016/1029024